Alphabetical Satisfiability Problem for Trace Equations
نویسندگان
چکیده
It is known that the satisfiability problem for equations over free partially commutative monoids is decidable but computationally hard. In this paper we consider the satisfiability problem for equations over free partially commutative monoids under the constraint that the solution is a subset of the alphabet. We prove that this problem is NP-complete for quadratic equations and that its uniform version is NP-complete for linear equations.
منابع مشابه
On the alphabetical satisfiability problem for trace equations
In this paper we summarize some results of a work in progress on the computational complexity of the alphabetical satisfiability problem for linear trace equations. In particular we prove that the problem is in P under some conditions on the maximal I-cliques.
متن کاملDeciding Hyperproperties
Hyperproperties, like observational determinism or symmetry, cannot be expressed as properties of individual computation traces, because they describe a relation between multiple computation traces. HyperLTL is a temporal logic that captures such relations through trace variables, which are introduced through existential and universal trace quantifiers and can be used to refer to multiple compu...
متن کاملSolutions of Word Equations Over Partially Commutative Structures
We give NSPACE(n logn) algorithms solving the following decision problems.Satisfiability: Is the given equation over a free partially commutative monoid with involution(resp. a free partially commutative group) solvable? Finiteness: Are there only finitely manysolutions of such an equation? PSPACE algorithms with worse complexities for the first problemare known, but so far, a P...
متن کاملUniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces
We continue our study of the complexity of temporal logics over concurrent systems that can be described by Mazurkiewicz traces. In a previous paper (CONCUR 2003), we investigated the class of local and MSO definable temporal logics that capture all known temporal logics and we showed that the satisfiability problem for any such logic is in PSPACE (provided the dependence alphabet is fixed). In...
متن کاملWord Equations with Length Constraints: What's Decidable?
We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality over string terms (word equations), linear inequality over the length function (length constraints), and membership in regular sets. These questions are import...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 19 شماره
صفحات -
تاریخ انتشار 2009